A quantum decoding algorithm of the simplex code
نویسندگان
چکیده
The paper is devoted to the quantum implementation of the decoding of the (classical) simplex code of length n. The implementation attempts at trading off time complexity with circuit complexity of decoding. We suggest a quantum decoding algorithm that operates on a circuit of size O(log n) and has time complexity O(log n). It also requires an additional circuit of size O(n) needed to gain bitwise access to the input vector. The best known classical parallel algorithm for this problem requires circuit size O(n log n) and time O(log n).
منابع مشابه
Fixture Design and Work Piece Deformation Optimization Using the Iterative Simplex Algorithm
Presents article is deal with optimization of the fixture for end milling process, the most important objective being the minimization of work piece deformation by changing the layout of fixture elements and the clamping forces. The main objective of this work has been the optimization of the fixtures Work piece deformation subjected to clamping forces for End milling operation. The present ana...
متن کاملLETTER Complex Hadamard Codes ∗
In this letter, a method to construct good binary and quaternary error correcting codes, called complex Hadamard codes, based on a complex Hadamard matrix is presented. The related properties of the codes are analyzed. In addition, through the operation in Z4 domain, a new simplex soft-decision decoding algorithm for the complex Hadamard codes is also proposed. key words: complex Hadamard matri...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملAn Efficient Code Based Digital Signature Algorithm
In the case of most current digital signature algorithm can be attacked by quantum algorithm, code based digital signature algorithm, which represents the Post-Quantum Cryptography, has become the hotspot of current research. CFS algorithms proposed in 2001 is one of the most important code based digital signature algorithm, but its signature efficiency is very low. In this paper, an improved C...
متن کامل